Equilibrium Selection via Optimal Transport
نویسندگان
چکیده
منابع مشابه
Optimal Policy with Probabilistic Equilibrium Selection
This paper introduces an approach to the study of optimal government policy in economies characterized by a coordination problem and multiple equilibria. Such models are often criticized as not being useful for policy analysis because they fail to assign a unique prediction to each possible policy choice. We employ a selection mechanism that assigns, ex ante, a probability to each equilibrium i...
متن کاملOptimal Slope Selection Via Expanders
Given n points in the plane and an integer k, the slope selection problem is to nd the pair of points whose connecting line has the k-th smallest slope. (In dual setting, given n lines in the plane, we want to nd the vertex of their arrangement with the k-th smallest x-coordinate.) Cole et al. 6] have given an O(n log n) solution (which is optimal), using the parametric searching technique of M...
متن کاملGeodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extracting several features from the set of geodesic distance maps to each point. The resulting high dimensional distributions are matched to perform retrieval using a fast approximate Wasserstein metric. This allows to propos...
متن کاملConvex Clustering via Optimal Mass Transport
We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we consider is that of approximating sample distributions by ones with sparse support. This provides a new viewpoint to clustering. We propose different relaxations o...
متن کاملNatural gradient via optimal transport I
We study a natural Wasserstein gradient flow on manifolds of probability distributions with discrete sample spaces. We derive the Riemannian structure for the probability simplex from the dynamical formulation of the Wasserstein distance on a weighted graph. We pull back the geometric structure to the parameter space of any given probability model, which allows us to define a natural gradient f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2020
ISSN: 0036-1399,1095-712X
DOI: 10.1137/18m1163828